Parking Functions on Directed Graphs and Some Directed Trees
نویسندگان
چکیده
منابع مشابه
Independent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملTwin minus domination in directed graphs
Let $D=(V,A)$ be a finite simple directed graph. A function$f:Vlongrightarrow {-1,0,1}$ is called a twin minus dominatingfunction (TMDF) if $f(N^-[v])ge 1$ and $f(N^+[v])ge 1$ for eachvertex $vin V$. The twin minus domination number of $D$ is$gamma_{-}^*(D)=min{w(f)mid f mbox{ is a TMDF of } D}$. Inthis paper, we initiate the study of twin minus domination numbersin digraphs and present some lo...
متن کاملCost-minimal trees in directed acyclic graphs
A number of examples are given where one seeks a minimal-cost tree to span a given subset of the nodes of a connected, directed, acyclic graph (we call such a graph monotonic). Some of these examples require an al~orithm to transform the problem into the form of a minimization problem in a monotonic graph.; this algorithm is also given. Finally, an implicit enumeration algorithm is presented fo...
متن کاملCovering Directed Graphs by In-Trees
Given a directed graphD = (V,A) with a set of d specified vertices S = {s1, . . . , sd} ⊆ V and a function f : S → Z+ where Z+ denotes the set of non-negative integers, we consider the problem which asks whether there exist ∑d i=1 f(si) in-trees denoted by Ti,1, Ti,2, . . . , Ti,f(si) for every i = 1, . . . , d such that Ti,1, . . . , Ti,f(si) are rooted at si, each Ti,j spans vertices from whi...
متن کاملSome Machines Defined bu Directed Graphs
This paper considers sorting machines defined by directed graphs. There is a level of description where the operations depend on comparison of real numbers, and a more primitive one on which the operations are in terms of bits. It is shown how the bit processing machines can be transformed into the machines that process real numbers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2020
ISSN: 1077-8926
DOI: 10.37236/9051